array data structureの例文

• This choice precludes the implementation of array types as array data structures.
• In Java, the growable bit-array data structure has a method that counts the number of bits that are set.
• For that reason, the elements of an array data structure are required to have the same size and should use the same data representation.
• In contrast, many array data structures allow access to any element with a constant number of operations, independent of the number of entries.
• Array types are often implemented by array data structures, but sometimes by other means, such as hash tables, linked lists, or search trees.
• Some array data structures do not reallocate storage, but do store a count of the number of elements of the array in use, called the count or size.
• This "'comparison of programming languages ( array ) "'compares the features of array data structures or matrix processing for over 48 various computer programming languages.
• On the other hand, dynamic arrays ( as well as fixed-size array data structures ) allow constant-time random access, while linked lists allow only sequential access to elements.
• This "'Comparison of programming languages ( associative arrays ) "'compares the features of associative array data structures or array-lookup processing for over 39 various computer programming languages.
• A "'sorted array "'is an array data structure in which each element is sorted in numerical, alphabetical, or some other order, and placed at equally spaced addresses in computer memory.
• A bitboard, often used for boardgames such as chess, checkers, word games, is a specialization of the bit array data structure, where each bit represents a game position or state, designed for optimization of speed and / or memory or disk use in mass calculations.
• In a 1999 paper, Brodnik et al . describe a tiered dynamic array data structure, which wastes only n 1 / 2 space for " n " elements at any point in time, and they prove a lower bound showing that any dynamic array must waste this much space if the operations are to remain amortized constant time.
• Moreover, arbitrarily many elements may be inserted into a linked list, limited only by the total memory available; while a dynamic array will eventually fill up its underlying array data structure and will have to reallocate  an expensive operation, one that may not even be possible if memory is fragmented, although the cost of reallocation can be averaged over insertions, and the cost of an insertion due to reallocation would still be amortized O ( 1 ).